Estimating the Information Potential with the Fast Gauss Transform
نویسندگان
چکیده
In this paper, we propose a fast and accurate approximation to the information potential of Information Theoretic Learning (ITL) using the Fast Gauss Transform (FGT). We exemplify here the case of the Minimum Error Entropy criterion to train adaptive systems. The FGT reduces the complexity of the estimation from O(N) to O(pkN) where p is the order of the Hermite approximation and k the number of clusters utilized in FGT. Further, we show that FGT converges to the actual entropy value rapidly with increasing order p unlike the Stochastic Information Gradient, the present O(pN) approximation to reduce the computational complexity in ITL. We test the performance of these FGT methods on System Identification with encouraging results.
منابع مشابه
The fast Gauss transform with all the proofs
In this report we discuss some technical aspects of the fast Gauss transform (FGT). The FGT is a special case of the single level FMM for the Gaussian potential. We give detailed derivation of the correct error bounds which is rather terse in the original paper. We also briefly discuss about the data structures to implement the space subdivision in higher dimensional spaces. [ FGT ]: April 8, 2006
متن کاملThe fast Gauss transform with complex parameters q
We construct a fast method, OðN logNÞ, for the computation of discrete Gauss transforms with complex parameters, capable of dealing with unequally spaced grid points. The method is based on Fourier techniques, and in particular it makes use of a modified unequally spaced fast Fourier transform algorithm, in combination with previously suggested divide and conquer strategies for ordinary fast Ga...
متن کاملDual-Tree Fast Gauss Transforms
Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation dominated by kernel summations. In this paper we present an improvement to the ...
متن کاملFast Gauss transforms with complex parameters using NFFTs
at the target knots yj ∈ [−14 , 1 4 ], j = 1, . . . ,M , where σ = a + ib, a > 0, b ∈ R denotes a complex parameter. Fast Gauss transforms for real parameters σ were developed, e.g., in [15, 8, 9]. In [12], we have specified a more general fast summation algorithm for the Gaussian kernel. Recently, a fast Gauss transform for complex parameters σ with arithmetic complexity O(N log N + M) was int...
متن کاملDetermination of Riboflavin by Nanocomposite Modified Carbon Paste Electrode in Biological Fluids Using Fast Fourier Transform Square Wave Voltammetry
Herein, fast Fourier transformation square-wave voltammetry (FFT-SWV) as a novel electrochemical determination technique was used to investigate the electrochemical behavior and determination of Riboflavin at the surface of a nanocomposite modified carbon paste electrode. The carbon paste electrode was modified by nanocomposite containing Samarium oxide (Sm2O3)/reduced gra...
متن کامل